Path graph

Results: 1083



#Item
151

PDF Document

Add to Reading List

Source URL: www.cs.ucsb.edu

Language: English - Date: 2012-06-06 03:08:31
152The Community-search Problem and How to Plan a Successful Cocktail Party ∗ Mauro Sozio

The Community-search Problem and How to Plan a Successful Cocktail Party ∗ Mauro Sozio

Add to Reading List

Source URL: research.yahoo.com

Language: English - Date: 2013-04-05 04:39:54
153Optimal Capacity Sharing of Networks with Multiple Overlays Zheng Ma∗ , Jiang Chen∗ , Yang Richard Yang∗ and Arvind Krishnamurthy† ∗ Department  of Computer Science

Optimal Capacity Sharing of Networks with Multiple Overlays Zheng Ma∗ , Jiang Chen∗ , Yang Richard Yang∗ and Arvind Krishnamurthy† ∗ Department of Computer Science

Add to Reading List

Source URL: www-net.cs.yale.edu

Language: English - Date: 2006-06-12 11:14:33
154Sage Reference Manual: Graph Theory Release 6.7 The Sage Development Team  June 24, 2015

Sage Reference Manual: Graph Theory Release 6.7 The Sage Development Team June 24, 2015

Add to Reading List

Source URL: doc.sagemath.org

Language: English - Date: 2015-06-24 05:21:38
155Journal of Environmental Management, 265–278 doi:jema, available online at http://www.idealibrary.com on Landscape connectivity: A conservation application of graph theory A. G. Bunn†§* ,

Journal of Environmental Management, 265–278 doi:jema, available online at http://www.idealibrary.com on Landscape connectivity: A conservation application of graph theory A. G. Bunn†§* ,

Add to Reading List

Source URL: www.physics.mun.ca

Language: English - Date: 2006-03-11 15:12:40
156System Area Network Mapping Alan M. Mainwaring Brent N. Chun Saul Schleimer Daniel S. Wilkerson

System Area Network Mapping Alan M. Mainwaring Brent N. Chun Saul Schleimer Daniel S. Wilkerson

Add to Reading List

Source URL: dsw.users.sonic.net

Language: English - Date: 2015-06-08 15:50:28
157A Constant Bound for the Periods of Parallel Chip-firing Games with Many Chips Paul Myer Kominers and Scott Duke Kominers Abstract. We prove that any parallel chip-firing game on a graph G with at least 4|E(G)| − |V (G

A Constant Bound for the Periods of Parallel Chip-firing Games with Many Chips Paul Myer Kominers and Scott Duke Kominers Abstract. We prove that any parallel chip-firing game on a graph G with at least 4|E(G)| − |V (G

Add to Reading List

Source URL: www.pkoms.com

Language: English - Date: 2011-12-29 23:15:14
158Optimization of Cable Cycles: A Trade-off between Reliability and Cost  Master Thesis in Micro-data Analysis Author: Barsam Payvar

Optimization of Cable Cycles: A Trade-off between Reliability and Cost Master Thesis in Micro-data Analysis Author: Barsam Payvar

Add to Reading List

Source URL: www.statistics.du.se

Language: English - Date: 2014-04-22 07:57:30
159Map-Matching for Low-Sampling-Rate GPS Trajectories Yin Lou Chengyang Zhang  Yu Zheng

Map-Matching for Low-Sampling-Rate GPS Trajectories Yin Lou Chengyang Zhang Yu Zheng

Add to Reading List

Source URL: www.cse.unt.edu

Language: English - Date: 2013-08-12 14:20:54
160MATH 205B REVIEW HOMEWORK Definitions — give precise definitions for these terms. 1. Path homotopy. 2. Functor. 3. Covering space.

MATH 205B REVIEW HOMEWORK Definitions — give precise definitions for these terms. 1. Path homotopy. 2. Functor. 3. Covering space.

Add to Reading List

Source URL: math.ucr.edu

Language: English - Date: 2007-03-04 22:05:28